Abstract State Machine Semantics of SDL

نویسندگان

  • Uwe Glässer
  • Rene Karges
چکیده

State Machine Semantics of SDL Uwe Glasser (Heinz Nixdorf Institut Universitat-GH Paderborn, Germany [email protected]) Ren e Karges (metronet GmbH Koln, Germany [email protected]) Abstract: Based on the ITU-T Recommendation Z.100 [27]|also known as SDL-92| we de ne a formal semantic model of the dynamic properties of Basic SDL in terms of an abstract SDL machine. More precisely, we use the concept of multi-agent real-time ASM [17] as a semantic platform on top of which we construct our mathematical description. The resulting interpretation model is not only mathematically precise but Based on the ITU-T Recommendation Z.100 [27]|also known as SDL-92| we de ne a formal semantic model of the dynamic properties of Basic SDL in terms of an abstract SDL machine. More precisely, we use the concept of multi-agent real-time ASM [17] as a semantic platform on top of which we construct our mathematical description. The resulting interpretation model is not only mathematically precise but also re ects the common understanding of SDL in a direct and intuitive manner; it provides a concise and understandable representation of the complete dynamic semantics of Basic SDL. Moreover, the model can easily be extended and modi ed|a particularly important issue for an evolving technical standard. In this article, we consider all relevant aspects concerning the behavior of channels, processes and timers with respect to signal transfer operations and timer operations. The model we obtain is intended as a basis for formal documentation as well as for executable high-level SDL speci cations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The formal semantics of SDL-2000: Status and perspectives

In November 1999, the current version of specification and description language (SDL), commonly referred to as SDL-2000, passed through ITU-T. In November 2000, the formal semantics of SDL2000 was officially approved to become part of the SDL language definition. It covers both the static and the dynamic semantics, and is based on the formalism of abstract state machines (ASMs). To support exec...

متن کامل

SDL-2000: A Language with a Formal Semantics

A new version of SDL called SDL-2000 is currently reaching maturity, and is expected to pass the standardization bodies shortly. It will offer new features as object-oriented data types, simplify and unify concepts of previous language versions and provide an alignment with UML. Due to the significant changes to SDL it was necessary to define a new formal semantics for SDL. Abstract State Machi...

متن کامل

Towards Design Verification and Validation at Multiple Levels of Abstraction

The specification of software for distributed production control systems is an error prone task. The ISILEIT project aims at the development of a seamless methodology for the integrated design, analysis and validation of such embedded systems. Suitable subsets of UML and SDL for the design of such systems are therefore identified in a first step. The paper then focuses on how we use a series of...

متن کامل

An Implementation of Sdl 92 Communication Semantics 1

The paper describes an abstract implementation of SDL communication semantics in the larger context of a design of SDL 92 simulation and veriication tools. SDL signal exchange involves routing for signal traac that allows for nondeterminism in communication path selection. The communication path selected may additionally be subject to a path constraint using SDL's via construct. We describe rst...

متن کامل

Generating Tests for Control Portion of SDL Specifications

ABSTRACT The signal SAVE construct is one of the features distinguishing SDL from convent specification and programming languages. On the other hand, this feature increase testing SDL-specified software. We present a testing approach consisting of the foll SDL specifications are first abstracted into finite state machines with save constructs machines are transformed to equivalent finite state ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1997